On global (strong) defensive alliances in some product graphs

نویسندگان

چکیده مقاله:

A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global defensive alliances in Cartesian product graphs, strong product graphs and direct product graphs. Specifically we give several bounds for the global defensive alliance number of these graph products and express them in terms of the global defensive alliance numbers of the factor graphs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global Defensive Alliances in Graphs

A defensive alliance in a graph G = (V,E) is a set of vertices S ⊆ V satisfying the condition that for every vertex v ∈ S, the number of neighbors v has in S plus one (counting v) is at least as large as the number of neighbors it has in V − S. Because of such an alliance, the vertices in S, agreeing to mutually support each other, have the strength of numbers to be able to defend themselves fr...

متن کامل

Strong Alliances in Graphs

For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...

متن کامل

On defensive alliances and strong global offensive alliances

We consider complexity issues and upper bounds for defensive alliances and strong global offensive alliances in graphs. We prove that it is NP-complete to decide for a given 6-regular graph G and a given integer a, whether G contains a defensive alliance of order at most a. Furthermore, we prove that determining the strong global offensive alliance number γô(G) of a graph G is APX-hard for cubi...

متن کامل

Global defensive k-alliances in graphs

Let Γ = (V,E) be a simple graph. For a nonempty set X ⊆ V , and a vertex v ∈ V , δX(v) denotes the number of neighbors v has in X. A nonempty set S ⊆ V is a defensive k-alliance in Γ = (V,E) if δS(v) ≥ δS̄(v)+k, ∀v ∈ S. A defensive k-alliance S is called global if it forms a dominating set. The global defensive k-alliance number of Γ, denoted by γ k(Γ), is the minimum cardinality of a defensive ...

متن کامل

Global defensive alliances in star graphs

A defensive alliance in a graph G = (V,E) is a set of vertices S ⊆ V where for each v ∈ S, at least half of the vertices in the closed neighborhood of v are in S. A defensive alliance S is called global if every vertex in V (G) \S is adjacent to at least one member of the defensive alliance S. In this paper, we derive an upper bound to the size of the minimum global defensive alliances in star ...

متن کامل

Defensive k-alliances in graphs

Let Γ = (V,E) be a simple graph of order n and degree sequence δ1 ≥ δ2 ≥ · · · ≥ δn. For a nonempty set X ⊆ V , and a vertex v ∈ V , δX(v) denotes the number of neighbors v has in X. A nonempty set S ⊆ V is a defensive k-alliance in Γ = (V,E) if δS(v) ≥ δS̄(v) + k, ∀v ∈ S. The defensive k-alliance number of Γ, denoted by ak(Γ), is defined as the minimum cardinality of a defensive k-alliance in Γ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 2  شماره 1

صفحات  21- 33

تاریخ انتشار 2017-06-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023